Explicit solutions to the matrix inverse problem AX = B
نویسندگان
چکیده
منابع مشابه
An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملan iterative method for the hermitian-generalized hamiltonian solutions to the inverse problem ax=b with a submatrix constraint
in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملAn Iterative Method for the Hermitian-generalized Hamiltonian Solutions to the Inverse Problem Ax=b with a Submatrix Constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem AX = B for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix A0, a solution A ∗ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of init...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولCentrum Voor Wiskunde En Informatica on the Size of Solutions of the Inequality Ax + B Ax
An estimate is given of the size of a solution n 2 N of the inequality (an+ b) < (an), gcd(a; b) = 1. Experiments indicate that this gives a useful indication of the size of the minimal solution. 2000 Mathematics Subject Classi cation: Primary 11A25. Secondary 11Y70. 1998 ACM Computing Classi cation System: F.2.1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1999
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)10008-8